Parallel fractional cascading on hypercube multiprocessors
نویسندگان
چکیده
منابع مشابه
Balanced Parallel Sort on Hypercube Multiprocessors
A parallel sorting algorithm for sorting n elements evenly distributed over Z d = p nodes of a d-dimensional hypercube is presented. The average running time of the algorithm is O( ( n log n)/p + p log2 n). The algorithm maintains a perfect load balance in the nodes by determining the (kn/p)th elements (k = 1,. . . , ( p 1)) of the final sorted list in advance. These p 1 keys are used to partit...
متن کاملAn approach to mapping parallel programs on hypercube multiprocessors
In this work, we propose a heuristic algorithm based on Genetic Algorithm for the task-to-processor mapping problem in the context of local-memory multiprocessors with a hypercube interconnection topology. Hypercube multiprocessors have offered a cost effective and feasible approach to supercomputing through parallelism at the processor level by directly connecting a large number of low-cost pr...
متن کاملParallel A* Algorithms and Their Performance on Hypercube Multiprocessors
In this paper we develop parallel A* algorithms suitable for distributed-memory machines. In parallel A* algorithms , ineeciencies grow with the number of processors P used, causing performance to drop signiicantly at lower and intermediate work densities (the ratio of the problem size to P). To alleviate this eeect, we propose a novel parallel startup phase and eecient dynamic work distributio...
متن کاملParallel Matrix Multiplication Algorithms on Hypercube Multiprocessors 1
In this paper, we present three parallel algorithms for matrix multiplication. The rst one, which employs pipelining techniques on a mesh grid, uses only one copy of data matrices. The second one uses multiple copies of data matrices also on a mesh grid. Although data communication operations of the second algorithm are reduced, the requirement of local data memory for each processing element i...
متن کاملParallel branch and bound on fine-grained hypercube multiprocessors
In this paper, we study parallel branch and bound on fine grained hypercube multiprocessors. Each processor in a fine grained system has only a very small amount of memory available, Therefore, current parallel branch and bound methods for coarse grained systems (s 1000 nodes) can not be applied, since all these methods assume that every processor stores the path from the node it is currently p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1992
ISSN: 0925-7721
DOI: 10.1016/0925-7721(92)90005-d